ISOMORPHISM, ISOSTERISM AND COVALENCE.

Syntactic isomorphism and non-isomorphism under ellipsis

Rooth (1992) and Fiengo and May (1994) argue that elliptical structures are subject to both a semantic and a syntactic parallelism requirement. Pseudosluicing, where an elliptical cleft takes a non-cleft as its antecedent, pose a problem for the idea that there is a syntactic parallelism requirement. In this talk, we will look at Spanish data (building on the analysis of Rodrigues et al. 2008) ...

On Isomorphism of Simplicial Complexes and Their Related Algebras

On Isomorphism Theorems of Fn -Polygroups

In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal  F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...

Forcing Isomorphism

If two models of a first order theory are isomorphic then they remain isomorphic in any forcing extension of the universe of sets. In general, however, such a forcing extension may create new isomorphisms. For example, any forcing that collapses cardinals may easily make formerly non-isomorphic models isomorphic. Certain model theoretic constraints on the theory and other constraints on the for...

Graph Isomorphism

While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...